Massively Parallel Tree Search for High-Dimensional Sphere Decoders
نویسندگان
چکیده
منابع مشابه
Massively Parallel Monte Carlo Tree Search
Monte Carlo Tree Search is a method of finding near-optimal solutions for large state-space problems. Currently, is it very important to develop algorithms being able to take advantage of great number of processors in such areas. In this paper MCTS parallel implementations for thousand of cores are presented and discussed. The MCTS parallelization method used is the root parallelization. Implem...
متن کاملDistributed Game Tree Search on a Massively Parallel System
During the World Computer Chess Championships in Madrid, November 1992, our distributed chess program ZUGZWANG ran on a 1024 processor machine and nished second place without having lost a game. This article presents measurements that show the behaviour of ZUGZWANG using massive parallelism. We will show that the network used to interconnect the processors is a crucial point for the eeciency of...
متن کاملPRA*: Massively Parallel Heuristic Search
In this paper we describe a variant of A* search designed to run on the massively parallel, SIMD Connection Machine (CM-2). The algorithm is designed to run in a limited memory by use of a retraction technique which allows nodes with poor heuristic values to be removed from the open list, until such time as they may need reexpansion, more promising paths having failed. Our algorithm, called PRA...
متن کاملNOHIS-Tree: High-Dimensional Index Structure for Similarity Search
In Content-Based Image Retrieval systems it is important to use an efficient indexing technique in order to perform and accelerate the search in huge databases. The used indexing technique should also support the high dimensions of image features. In this paper we present the hierarchical index NOHIS-tree (Non Overlapping Hierarchical Index Structure) when we scale up to very large databases. W...
متن کاملHigh Performance Networks for Massively Parallel Architectures
The past few years have seen a rise in popularity of massively parallel architectures that use fat-trees as their interconnection networks. In this paper we study the communication performance of a parametric family of fat-trees, the k-ary n-trees, built with constant arity switches interconnected in a regular topology. Through simulation on a 4-ary 4-tree with 256 nodes, we analyze some varian...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 2019
ISSN: 1045-9219,1558-2183,2161-9883
DOI: 10.1109/tpds.2018.2874002